Matrix constructions of centroid sets for classification systems

Recursive constructions for large sets of resolvable hybrid triple systems

Centroid Triangulations from k-Sets

Given a set V of n points in the plane, no three of them being collinear, a convex inclusion chain of V is an ordering of the points of V such that no point belongs to the convex hull of the points preceding it in the ordering. We call k-set of the convex inclusion chain, every k-set of an initial subsequence of at least k points of the ordering. We show that the number of such k-sets (without ...

Constructions for Difference Triangle Sets

Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are the best currently known.

Centroid - Based Document Classification :

In recent years we have seen a tremendous growth in the volume of text documents available on the Internet, digital libraries, news sources, and company-wide intranets. Automatic text categorization, which is the task of assigning text documents to pre-specified classes (topics or themes) of documents, is an important task that can help both in organizing as well as in finding information on th...

Centroid - Based Document Classification : Analysis

In recent years we have seen a tremendous growth in the volume of text documents available on the Internet, digital libraries, news sources, and company-wide intranets. Automatic text categorization, which is the task of assigning text documents to pre-specified classes (topics or themes) of documents, is an important task that can help both in organizing as well as in finding information on th...